import java.util.Scanner;

public class a215_明明愛數數 {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		
		int a, b;
		
		while(input.hasNext()) {
			a = input.nextInt();
			b = input.nextInt();
			
			end = b;
			sum = 0;
			
			System.out.println(Integer.toString(Recursion(a)));
			
			input.nextLine();
		}
	}
	
	//-------------------------------------------------------
	
	public static int end = 0;
	public static int sum = 0;
	
	//-------------------------------------------------------
	
	public static int Recursion(int n) {
		sum += n;
		
		if(sum > end)
			return 1;
		return Recursion(n + 1) + 1;
	}
}